Pareto Dominance-Based Algorithms With Ranking Methods for Many-Objective Optimization

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Predictive Pareto Dominance Based Algorithm for Many-Objective Problems

1. Abstract Multiobjective genetic algorithms (MOGAs) have successfully been used on a wide range of real world problems. However, it is generally accepted that the performance of most state-of-the-art multiobjective genetic algorithms tend to perform poorly for problems with more than four objectives, termed many-objective problems. The contribution of this paper is a new approach for identify...

متن کامل

Dominance-Based Pareto-Surrogate for Multi-Objective Optimization

Mainstream surrogate approaches for multi-objective problems build one approximation for each objective. Mono-surrogate approaches instead aim at characterizing the Pareto front with a single model. Such an approach has been recently introduced using a mixture of regression Support Vector Machine (SVM) to clamp the current Pareto front to a single value, and one-class SVM to ensure that all dom...

متن کامل

Effective ranking + speciation = Many-objective optimization

Multiobjective optimization problems have been widely addressed using evolutionary computation techniques. However, when dealing with more than three conflicting objectives (the so-called many-objective problems), the performance of such approaches deteriorates. The problem lies in the inability of Pareto dominance to provide an effective discrimination. Alternative ranking methods have been su...

متن کامل

A clustering-ranking method for many-objective optimization

In evolutionary multi-objective optimization, balancing convergence and diversity remains a challenge and especially for many-objective (three or more objectives) optimization problems (MaOPs). To improve convergence and diversity for MaOPs, we propose a new approach: clustering-ranking evolutionary algorithm (crEA), where the two procedures (clustering and ranking) are implemented sequentially...

متن کامل

Pareto Local Search Algorithms for Anytime Bi-objective Optimization

Pareto local search (PLS) is an extension of iterative improvement methods for multi-objective combinatorial optimization problems and an important part of several state-of-the-art multi-objective optimizers. PLS stops when all neighbors of the solutions in its solution archive are dominated. If terminated before completion, it may produce a poor approximation to the Pareto front. This paper pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2017

ISSN: 2169-3536

DOI: 10.1109/access.2017.2716779